Application of Iterative Methods for Solving Nonsymmetric Linear Systems in the Simulation of Semiconductor Processing
نویسنده
چکیده
This paper presents a systematic comparison of recently developed iterative methods for solving nonsymmetric linear equations arising from the numerical simulation of semiconductor processing. A non comprehensive survey of the literature concerning iterative solvers is given including theoretical studies as well as current articles on practical applications. In particular, we consider the conjugate gradient-type algorithms CGS, Bi-CGSTAB and GMRES as well as the Broyden type secant method GB specially adapted to the linear case. At the moment these methods are among the most frequently applied techniques for the solution of nonsymmetric linear systems. The algorithms, including ILU-D (incomplete LU-diagonal decomposition) as a preconditioner, are given and their performance is compared on an industrial application within the process simulator MIMAS II. The simulation of semiconductor processing is an important and challenging area of industrial application and therefore an ideal eld for testing the performance of iterative methods in real life problems. To highlight the physical background of this application, the physics of process simulation is brie y sketched.
منابع مشابه
A New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation
In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملThe Iterative Solver RISOLV with Application to the Exterior Helmholtz Problem
The innermost computational kernel of many large-scale scientific applications is often a large set of linear equations of the form Ax = b which typically consumes a significant portion of the overall computational time required by the simulation. The traditional approach for solving this problem is to use direct methods. This approach is often preferred in industry because direct solvers are r...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995